A Novel Approach to Solving N-Queens Problem
نویسنده
چکیده
Placing n mutually non-attacking queens on an n by n chessboard is a classical problem in the artificial intelligence (AI) area. Over the past few decades, this problem has become important to computer scientists for providing solutions to many useful and practical applications. In this paper, we present a novel approach to solving the n-queens problem in a considerably less execution time. The proposed technique works by directly placing the queens on the board in a regular pattern based on some queen-movement rules.
منابع مشابه
An Adaptive Genetic Algorithm for Solving N-Queens Problem
-In this paper a Meta-heuristic approach for solving the N-Queens Problem is introduced to find the best possible solution in a reasonable amount of time. Genetic Algorithm is used with a novel fitness function as the Meta-heuristic. The aim of N-Queens Problem is to place N queens on an N x N chessboard, in a way so that no queen is in conflict with the others. Chromosome representation and ge...
متن کاملA Quantum-Inspired Differential Evolution Algorithm for Solving the N-Queens Problem
In this paper, a quantum-inspired differential evolution algorithm for solving the N-queens problem is presented. The N-queens problem aims at placing N queens on an NxN chessboard, in such a way that no queen could capture any of the others. The proposed algorithm is a novel hybridization between differential evolution algorithms and quantum computing principles. Accordingly, differential evol...
متن کاملA Parallel Search Algorithm for the N-Queens Problem
The N-queens problem is to place n queens on an n n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the N-queens problem. The algorithm nds a solution by performing a probabilistic parallel search. By using n processors, its run...
متن کاملA Parallel Search Algorithm for the N - Queens ProblemAugust
The N-queens problem is to place n queens on an n n chessboard such that no two queens attack each other. This problem is commonly used as a benchmark for algorithms that solve constraint satisfaction problems (CSP). This paper describes a novel parallel algorithm for the N-queens problem. The algorithm nds a solution by performing a probabilistic parallel search. By using n processors, its run...
متن کاملOvariectomy in Queens: Two portals Laparoscopy vs Conventional Approach
Ovariectomy in Queens: Two portals Laparoscopy vs Conventional Approach Navid Salmanzadeh Zahedani1 , Jalal Bakhtiari1, DVM, PhD, Alizera Khalaj2, MD, Behnam Vafadari1 , D. V. M., Amir Niasari-Naslaji3, DVM, PhD Objective- The purpose of this study was to compare two portal laparoscopy and conventional approach for ovariectomy in queen. Design- Retrospective study. Animals- Adult healthy ...
متن کامل